On the Double Coset Membership Problem for Permutation Groups
نویسنده
چکیده
We show that the Double Coset Membership problem for permutation groups possesses perfect zero-knowledge proofs.
منابع مشابه
Quantum Algorithms for a Set of Group Theoretic Problems
We study two group theoretic problems, Group Intersection and Double Coset Membership, in the setting of black-box groups, where Double Coset Membership generalizes a set of problems, including Group Membership, Group Factorization, and Coset Intersection. No polynomial-time classical algorithms are known for these problems. We show that for solvable groups, there exist efficient quantum algori...
متن کاملDouble-coset enumeration algorithm for symmetrically generated groups
The Todd-Coxeter algorithm described in [13] remains a primary reference for coset enumeration programs. It may be viewed as a means of constructing permutation representations of finitely presented groups. A number of effective computer programs for singlecoset enumeration have been described, see, for example, [2, 7, 8]. Enumerating double cosets, rather than single cosets, gives substantial ...
متن کاملSome relations between $L^p$-spaces on locally compact group $G$ and double coset $Ksetminus G/H$
Let $H$ and $K$ be compact subgroups of locally compact group $G$. By considering the double coset space $Ksetminus G/H$, which equipped with an $N$-strongly quasi invariant measure $mu$, for $1leq pleq +infty$, we make a norm decreasing linear map from $L^p(G)$ onto $L^p(Ksetminus G/H,mu)$ and demonstrate that it may be identified with a quotient space of $L^p(G)$. In addition, we illustrate t...
متن کاملRepresentations of Double Coset Lie Hypergroups
We study the double cosets of a Lie group by a compact Lie subgroup. We show that a Weil formula holds for double coset Lie hypergroups and show that certain representations of the Lie group lift to representations of the double coset Lie hypergroup. We characterize smooth (analytic) vectors of these lifted representations.
متن کاملA Systematic Design of Cellular Permutation Arrays
This paper presents a parametrized design technique for cellular permutation arrays based on coset decompositions of symmetric groups. A new type of permutation cell, referred to as a coset generator, is introduced to customize the propagation delay, fan-in, fan-out, and number of edges in the target network. To aid in the design process, a cost function is derived expressing the number of edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0801.4911 شماره
صفحات -
تاریخ انتشار 2008